Normalization and continuation-passing-style interpretation of simply-typed call-by-need λ-calculus with control
نویسندگان
چکیده
Ariola et al defined a call-by-need λ-calculus with control, together with a sequent calculus presentation of it. They mechanically derive from the sequent calculus presentation a continuationpassing-style transformation simulating the reduction. In this paper we consider the simply-typed version of the calculus and proove its normalization by means of a realizability interpretation. This justifies a posteriori the design choice of the translation, and is to be contrasted with Okasaki et al. semantics which is not normalizing even in the simply-typed case. Besides, we also present a type system for the target language of the continuation-passing-style translation. 1998 ACM Subject Classification F.4.1 Lambda calculus and related systems
منابع مشابه
Typeful Normalization by Evaluation
We present the first typeful implementation of Normalization by Evaluation for the simply typed λ-calculus with sums and control operators: we guarantee type preservation and η-long (modulo commuting conversions), β-normal forms using only Generalized Algebraic Data Types in a general-purpose programming language, here OCaml; and we account for finite sums and control operators with Continuatio...
متن کاملContinuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi
The intuitionistic fragment of the call-by-name version of Curien and Herbelin’s λμμ̃-calculus is isolated and proved strongly normalising by means of an embedding into the simply-typed λ-calculus. Our embedding is a continuation-and-garbage-passing style translation, the inspiring idea coming from Ikeda and Nakazawa’s translation of Parigot’s λμ-calculus. The embedding simulates reductions whil...
متن کاملA Context-based Approach to Proving Termination of Evaluation
We show a context-based approach to proving termination of evaluation in reduction semantics (i.e., a form of operational semantics with explicit representation of reduction contexts), using Tait-style reducibility predicates defined on both terms and contexts. We consider the simply typed lambda calculus as well as its extension with abortive control operators for first-class continuations und...
متن کاملRealizability Interpretation and Normalization of Typed Call-by-Need $$\lambda$$-calculus With Control
We define a variant of Krivine realizability where realizers are pairs of a term and a substitution. This variant allows us to prove the normalization of a simply-typed call-by-need λ-calculus with control due to Ariola et al. Indeed, in such call-by-need calculus, substitutions have to be delayed until knowing if an argument is really needed. We then extend the proof to a call-by-need λ-calcul...
متن کاملOn the Relation of Interaction Semantics to Continuations and Defunctionalization
In game semantics and related approaches to programming language semantics, programs are modelled by interaction dialogues. Such models have recently been used in the design of new compilation methods, e.g. for hardware synthesis or for programming with sublinear space. This paper relates such semantically motivated non-standard compilation methods to more standard techniques in the compilation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017